Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix
نویسندگان
چکیده
منابع مشابه
Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix
A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players’ actions. The players communicate over a strongly connected digraph to send/receive the estimates of the other players’ actions to/from the other local players according to a gossip communication protocol. Due to asymmetric infor...
متن کاملStochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
We introduce a multi-input stochastic extremum seeking algorithm to solve the problem of seeking Nash equilibria for a noncooperative game whose N players seek to maximize their individual payoff functions. The payoff functions are general (not necessarily quadratic), and their forms are not known to the players. Our algorithm is a nonmodel-based approach for asymptotic attainment of the Nash e...
متن کاملNash Equilibrium Seeking for Dynamic Systems with Non-Quadratic Payoffs
We consider a general, stable nonlinear dynamic system with N inputs and N outputs, where in the steady state, the output signals represent the non-quadratic payoff functions of a noncooperative game played by the values of the input signals. We introduce a non-model based approach for locally stable convergence to a steady-state Nash equilibrium. In classical game theory algorithms, each playe...
متن کاملMatrix Games and Nash Equilibrium
A crime has been committed for which two prisoners are held incommunicado. The district attorney is assigned to question the prisoners. He designs the following incentive structure to induce the prisoners to talk. If neither prisoner talks, both prisoners automatically receive mild sentences (payoff 4). But if exactly one prisoner squeals on the other, the squealer is let off scot free (payoff ...
متن کاملNash Equilibrium Seeking in Subnetwork Zero-Sum Games with Switching Communication Graphs
In this paper, we investigate a distributed Nash equilibrium seeking problem for a timevarying multi-agent network consisting of two subnetworks. We propose a subgradientbased distributed algorithm to seek a Nash equilibrium of a zero-sum game, where the two subnetworks share the same sum objective function. We show that the proposed distributed algorithm with homogenous stepsize can achieve a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EAI Endorsed Transactions on Collaborative Computing
سال: 2020
ISSN: 2312-8623
DOI: 10.4108/eai.13-7-2018.158526